Minimum-Distortion Isometric Shape Correspondence Using EM Algorithm
نویسندگان
چکیده
منابع مشابه
Discrete Minimum Distortion Correspondence Problems for Non-rigid Shape Matching
Similarity and correspondence are two fundamental archetype problems in shape analysis, encountered in numerous application in computer vision and pattern recognition. Many methods for shape similarity and correspondence boil down to the minimum-distortion correspondence problem, in which two shapes are endowed with certain structure, and one attempts to find the matching with smallest structur...
متن کاملAlgorithms for 3D Isometric Shape Correspondence
There are many pairs of objects in the digital world that need to be related before performing any comparison, transfer, or analysis in between. The shape correspondence algorithms essentially address this problem by taking two shapes as input with the aim of finding a mapping that couples similar or semantically equivalent surface points of the given shapes. We focus on computing correspondenc...
متن کاملCoarse-to-Fine Combinatorial Matching for Dense Isometric Shape Correspondence
We present a dense correspondence method for isometric shapes, which is accurate yet computationally efficient. We minimize the isometric distortion directly in the 3D Euclidean space, i.e., in the domain where isometry is originally defined, by using a coarse-to-fine sampling and combinatorial matching algorithm. Our method does not require any initialization and aims to find an accurate solut...
متن کامل3B İzometrik Şekil Eşleme 3D Isometric Shape Correspondence
We address the problem of correspondence between 3D isometric shapes. We present an automatic method that finds the optimal correspondence between two given (nearly) isometric shapes by minimizing the amount of deviation from isometry. We optimize the isometry error in two steps. In the first step, the 3D points uniformly sampled from the shape surfaces are transformed into spectral domain base...
متن کاملCoarse-to-Fine Isometric Shape Correspondence by Tracking Symmetric Flips
We address the symmetric flip problem that is inherent to multiresolution isometric shape matching algorithms. To this effect, we extend our previous work which handles the dense isometric correspondence problem in the original 3D Euclidean space via coarse-to-fine combinatorial matching. The key idea is based on keeping track of all optimal solutions, which may be more than one due to symmetry...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Pattern Analysis and Machine Intelligence
سال: 2012
ISSN: 0162-8828,2160-9292
DOI: 10.1109/tpami.2012.26